Case Studies in Complementarity: Improving Model Formulation
نویسندگان
چکیده
Over the past several years, many practitioners have been formulating nonlinear variational inequalities as mixed complementarity problems within modeling languages such as GAMS and AMPL. Sometimes the models generated are poorly specified, either because the function is undefined near the solution or the problem is ill-conditioned or singular. In this paper, we look at information provided by the PATH solver about the model that can be used to identify problem areas and improve formulation. Descriptions and uses of the data provided are detailed via several case studies.
منابع مشابه
TCP Network Calculus: The case of large delay-bandwidth product
We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate our model as a nonlinear complementarity problem. Then we transform the model into two equivalent formulations: fixed point formulation and nonlinear programming formulation. These equivalent formulations provide efficient computat...
متن کاملA Complementarity Problem Approach for Multibody Contact Dynamics with Regularized Friction
Contact modelling, simulation, and analysis of mechanical systems with friction need proper treatments due to the non-smooth nature of the contact phenomenon. Two main approaches to deal with the contact problems are constraint and compliant based formulations [3]. In constraint based approaches, the problem is formulated by imposing the kinematic unilateral constraints between bodies in contac...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کاملOn Reduced Convex QP Formulations of Monotone LCP Problems
Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation|one that has fewer constraints than the \stan-dard" QP formulation|is available. We mention several instances of this class, including the known case in which the coeecient matrix in the LCP...
متن کاملA Homogeneous Model for Monotone Mixed Horizontal Linear Complementarity Problems
We propose a homogeneous model for the class of mixed horizontal linear complementarity problems. The proposed homogeneous model is always solvable and provides the solution of the original problem if it exists, or a certificate of infeasibility otherwise. Our formulation preserves the sparsity of the original formulation and does not reduce to the homogeneous model of the equivalent standard l...
متن کامل